Guess & Check Codes for Deletions, Insertions, and Synchronization
نویسندگان
چکیده
منابع مشابه
Guess & Check Codes for Deletions, Insertions, and Synchronization
We consider the problem of constructing codes that can correct δ deletions occurring in an arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes are zeroerror single deletion (δ = 1) correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for δ ≥ 2 deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) c...
متن کاملGuess & check codes for deletions and synchronization
We consider the problem of constructing codes that can correct δ deletions occurring in an arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions (δ = 1) with an asymptotically optimal redundancy. Finding similar codes for δ ≥ 2 deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) codes, that...
متن کاملCorrecting Bursty and Localized Deletions Using Guess & Check Codes
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when δ ≤ w deletions occur in a window of size at most w bits. These δ deletions are not necessarily consecutive, but are restricted to the window of size w. The localized deletions model is a generalization o...
متن کاملSynchronization from Insertions and Deletions
We study the problem of synchronizing two files X and Y at two distant nodes A and B that are connected through a two-way communication channel. We assume that file Y at node B is obtained from file X at node A by inserting and deleting a small fraction of symbols in X . More specifically, we consider the case where X is a non-binary non-uniform string, and deletions and insertions happen unifo...
متن کاملSynchronization Strings: List Decoding for Insertions and Deletions
We study codes that are list-decodable under insertions and deletions (“insdel codes”). Specifically, we consider the setting where, given a codeword x of length n over some finite alphabet Σ of size q, δ · n codeword symbols may be adversarially deleted and γ · n symbols may be adversarially inserted to yield a corrupted word w. A code is said to be list-decodable if there is an (efficient) al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2841936